Cutting Cakes and Kissing Circles

نویسندگان

چکیده

To divide a cake into equal sized pieces most people use knife and mixture of luck dexterity. These attempts are often met with varying success. Through precise geometric constructions performed the replacing Euclid's straightedge without using compass we find methods for solving certain cake-cutting problems exactly. Since it is impossible to exactly bisect circular when its center not known, our need multiple cakes. Using three cakes present simple method bisecting each them or their centers. Moreover, given marked cut n size n=3,4 6. Our based upon by Steiner Cauer from 19th early 20th century.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cutting Cakes Carefully

Ted Hill is professor emeritus of mathematics at Georgia Tech, and has held visiting appointments in Costa Rica, Germany (Gauss Professor), Holland (NSF-NATO Fellow), Israel, Italy, and Mexico. He studied at West Point (B.S.), Stanford (M.S.), Göttingen (Fulbright Scholar), and Berkeley (M.A., Ph.D.), and his primary research interests are in mathematical probability, especially optimal-stoppin...

متن کامل

Cutting Circles into Pseudo-segments and Improved Bounds for Incidences

We show that n arbitrary circles in the plane can be cut into O(n) arcs, for any ε > 0, such that any pair of arcs intersect at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m points and n circles. An improved incidence bound is also obtained for graphs of polynomials of any constant m...

متن کامل

Cutting circles and polygons from area-minimizing rectangles

A set of circles, rectangles, and convex polygons are to be cut from rectangular design plates to be produced, or from a set of stocked rectangles of known geometric dimensions. The objective is to minimize the area of the design rectangles. The design plates are subject to lower and upper bounds of their widths and lengths. The objects are free of any orientation restrictions. If all nested ob...

متن کامل

Quaternionic Product of Circles and Cycles and Octonionic Product for Pairs of Circles

This paper concerns with a product of circles induced by the quaternionic product considered in a projective manner. Several properties of this composition law are derived and on this way we arrive at some special numbers as roots or powers of unit. We extend this product to cycles as oriented circles and to pairs of circles by using the algebra of octonions. Three applications of the given pro...

متن کامل

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces

We show that n arbitrary circles in the plane can be cut into O(n) arcs, for any ε > 0, such that any pair of arcs intersect at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m points and n circles. An improved incidence bound is also obtained for graphs of polynomials of any constant m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Mathematical Intelligencer

سال: 2021

ISSN: ['0343-6993', '1866-7414']

DOI: https://doi.org/10.1007/s00283-021-10071-z